Quadratically converging rational mean iterations
نویسندگان
چکیده
منابع مشابه
Quadratically Converging Algorithms for it
We present a quadratically converging algorithm for m based on a formula of Legendre's for complete elliptic integrals of modulus sin(w/12) and the arithmetic-geometric mean iteration of Gauss and Legendre. Precise asymptotics are provided which show this algorithm to be (marginally) the most efficient developed to date. As such it provides a natural computational check for the recent large-sca...
متن کاملA Quadratically Converging Algorithm of Multidimensional Scaling
Multidimensional scaling (MDS) is well known technique for analysis of multidimensional data. The most important part of implementation of MDS is minimization of STRESS function. The convergence rate of known local minimization algorithms of STRESS function is no better than superlinear. The regularization of the minimization problem is proposed which enables the minimization of STRESS by means...
متن کاملMore Quadratically Converging Algorithms for $\pi$
We present a quadratically converging algorithm for or based on a formula of Legendre's for complete elliptic integrals of modulus sin(7r/12) and the arithmetic-geometric mean iteration of Gauss and Legendre. Precise asymptotics are provided which show this algorithm to be (marginally) the most efficient developed to date. As such it provides a natural computational check for the recent large-s...
متن کاملOn the Number of Iterations to the Closest Quadratically Invariant Information Constraint
Quadratic invariance is a condition which has been shown to allow for optimal decentralized control problems to be cast as convex optimization problems. The condition relates the constraints that the decentralization imposes on the controller to the structure of the plant. Recent work considered the problem of finding the closest subset and superset of the decentralization constraint which are ...
متن کاملHigher Order Aitken Extrapolation with Application to Converging and Diverging Gauss-Seidel Iterations
In this paper Aitken’s extrapolation normally applied to convergent fixed point iteration is extended to extrapolate the solution of a divergent iteration. In addition, higher order Aitken extrapolation is introduced that enables successive decomposition of high Eigen values of the iteration matrix to enable convergence. While extrapolation of a convergent fixed point iteration using a geometri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1991
ISSN: 0022-247X
DOI: 10.1016/0022-247x(91)90043-y